Generalized Discrete Preference Games
نویسندگان
چکیده
Recently, much attention has been devoted to discrete preference games to model the formation of opinions in social networks. More specifically, these games model the agents’ strategic decision of expressing publicly an opinion, which is a result of an interplay between the agent’s private belief and the social pressure. However, these games have very limited expressive power; they can model only very simple social relations and they assume that all the agents respond to social pressure in the same way. In this paper, we define and study the novel class of generalized discrete preference games. These games have additional characteristics that can model social relations to allies or competitors and complex relations among more than two agents. Moreover, they introduce different levels of strength for each relation, and they personalize the dependence of each agent to her neighborhood. We show that these novel games admit generalized ordinal potential functions and, more importantly, that every two-strategy game that admits a generalized ordinal potential function is structurally equivalent to a generalized discrete preference game. This implies that the games in this novel class capture the full generality of two-strategy games in which the existence of (pure) equilibria is guaranteed by topological arguments.
منابع مشابه
Discrete preference games: social influence through coordination, and beyond
We study discrete preference games that have been used to model issues such as the formation of opinions or the adoption of innovations in the context of a social network. In these games, the payoff of each agent depends on the agreement of her strategy to her internal belief and on its coordination with the strategies of her neighbors in the social network. Recent papers have obtained bounds o...
متن کاملMaximal elements of $mathscr{F}_{C,theta}$-majorized mappings and applications to generalized games
In the paper, some new existence theorems of maximal elements for $mathscr{F}_{C,theta}$-mappings and $mathscr{F}_{C,theta}$-majorized mappings are established. As applications, some new existence theorems of equilibrium points for one-person games, qualitative games and generalized games are obtained. Our results unify and generalize most known results in recent literature.
متن کاملGeneralized Maximum Entropy estimation of discrete sequential move games of perfect information
We propose a data-constrained generalized maximum entropy estimator for discrete sequential move games of perfect information. Unlike most other work on the estimation of complete information games, the method we proposed is data constrained and requires no simulation or assumptions about the distribution of random preference shocks. We formulate the GME estimation as a (convex) mixed-integer n...
متن کاملRobustness in Discrete Preference Games
In a discrete preference game, each agent is equipped with an internal belief and declares her preference from a discrete set of alternatives. The payoff of an agent depends on whether the declared preference agrees with the belief of the agent and on the coordination with the preferences declared by the neighbors of the agent in the underlying social network. These games have been used to mode...
متن کاملCompact Preference Representation for Boolean Games
Boolean games, introduced by [15, 14], allow for expressing compactly two-players zero-sum static games with binary preferences: an agent’s strategy consists of a truth assignment of the propositional variables she controls, and a player’s preferences is expressed by a plain propositional formula. These restrictions (two-players, zero-sum, binary preferences) strongly limit the expressivity of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016